package com.bjsxt.datastructure.btree;

public interface BinaryTree {

    public boolean isEmpty();

    public int size();

    public int getHeight();

    public Node findKey(int value);

    public void preOrderTraverse();

    public void inOrderTraverse();

    public void postOrderTraverse();

    public void postOrderTraverse(Node node);

    public void inOrderByStack();

    public void preOrderByStack();

    public void postOrderByStack();

    public void levelOrderByStack();
}
